Proof search in Lax Logic
نویسنده
چکیده
A Gentzen sequent calculus for Lax Logic is presented, the proofs in which naturally correspond in a 1–1 way with the normal natural deductions for the logic. The propositional fragment of this calculus is then used a basis for another calculus, one which uses a history mechanism in order to give a decision procedure for propositional Lax Logic.
منابع مشابه
Proof search issues in some non-classical logics
This thesis develops techniques and ideas on proof search. Proof search is used with one of two meanings. Proof search can be thought of either as the search for a yes/no answer to a query (theorem proving), or as the search for all proofs of a formula (proof enumeration). This thesis is an investigation into issues in proof search in both these senses for some non-classical logics. Gentzen sys...
متن کاملLogic programming: laxness and saturation
A propositional logic program P may be identified with a PfPf -coalgebra on the set of atomic propositions in the program. The corresponding C(PfPf )coalgebra, where C(PfPf ) is the cofree comonad on PfPf , describes derivations by resolution. That correspondence has been developed to model first-order programs in two ways, with lax semantics and saturated semantics, based on locally ordered ca...
متن کاملPropositional Lax Logic Propositional Lax Logic
We investigate a peculiar intuitionistic modal logic, called Propositional Lax Logic (PLL), which has promising applications to the formal veri cation of computer hardware. The logic has emerged from an attempt to express correctness `up to' behavioural constraints | a central notion in hardware veri cation | as a logical modality. As a modal logic it is special since it features a single modal...
متن کاملCover semantics for quantified lax logic
Lax modalities occur in intuitionistic logics concerned with hardware verification, the computational lambda calculus, and access control in secure systems. They also encapsulate the logic of Lawvere-Tierney-Grothendieck topologies on topoi. This paper provides a complete semantics for quantified lax logic by combining the Beth-Kripke-Joyal cover semantics for first-order intuitionistic logic w...
متن کاملAn extended framework for specifying and reasoning about proof systems
It has been shown that linear logic can be successfully used as a framework for both specifying proof systems for a number of logics, as well as proving fundamental properties about the specified systems. This paper shows how to extend the framework with subexponentials in order to declaratively encode a wider range of proof systems, including a number of non-trivial proof systems such as multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 11 شماره
صفحات -
تاریخ انتشار 2001